Subsumption Propagation between Remote Ontologies in Distributed Description Logic
نویسنده
چکیده
Distributed Description Logics (DDL) is a KR formalism that enables reasoning with multiple ontologies interconnected by directional semantic mapping. Subsumption propagation in DDL from one ontology to another as a result of mappings has been studied, but only for a simplified case when only two ontologies are involved. In this paper we study subsumption propagation in more complex cases, when two ontologies are only connected indirectly, via several other ontologies. We characterize cases in which such subsumption propagation occurs. However, we also identify more complex situations in which subsumption propagation does not occur even if we would expect it. In addition, we propose an adjusted semantics for DDL. Under this semantics, subsumption propagates to remote ontologies to a far greater extent. Other desired properties that have been postulated for DDL, such as directionality and restrained inconsistency propagation are retained.
منابع مشابه
Towards Distributed Tableaux Reasoning Procedure for DDL with Increased Subsumption Propagation between Remote Ontologies
Distributed Description Logics (DDL) enable reasoning with multiple ontologies interconnected by directional semantic mapping. In DDL semantic mapping is indicated by so called bridge rules. There are two kinds: intoand onto-bridge rules. Mappings between concepts allow subsumption to propagate from one ontology to another. However, in some cases, especially when more than two local ontologies ...
متن کاملAugmenting Subsumption Propagation in Distributed Description Logics
Distributed Description Logics (DDL) enable reasoning with multiple ontologies interconnected by directional semantic mapping, called bridge rules. Bridge rules map concepts of a source ontology into concepts of a target ontology. Concept subsumptions of the source ontology can be propagated according to a propagation pattern expressed by bridge rules into concept subsumptions of the target ont...
متن کاملA Distributed Tableau Algorithm for Package-based Description Logics
Package-based Description Logics (P-DL) is a novel formalism for modular ontologies. In P-DL, an ontology is composed of a collection of modules called packages. A package can partially reuse knowledge in other packages by a selective importing mechanism. This paper investigates a sound and complete tableau-based reasoning algorithm for a P-DL language ALCPC , which extends ALC with acyclic con...
متن کاملDistributed Resolution for ALC - First Results
The use of description logic as the basis for semantic web languages has led to new requirements with respect to scalable and non-standard reasoning. Description logic is a decidable fragment of FOL but still, the standard reasoning tasks are of exponential complexity, satisfiability and subsumption tests are often intractable on large ontologies. Existing large ontologies have a modular struct...
متن کاملIntegrated Distributed Description Logics
We propose a Description-Logics-based language that extends standard DL with distributed capabilities. More precisely, it offers the possibility to formally describe the semantic relations that exist between two ontologies in a networked knowledge-based system. Contrary to Distributed Description Logics [2], it is possible to compose correspondences (≈ bridge rules), while still being able to h...
متن کامل